Unified approaches for solvable and unsolvable linear complementarity problems
نویسندگان
چکیده
In this paper, general linear complementarity problems(Lf'Ps) are studied via global optimization problems. In particular, unsolvable 'LCPs are reformulated as multicriteria optimization, minimax optimization and quadratic programming problems. The solvability and unsolvability of LCPs are obtained via these reformulations. Furthermore, first-order and second-order global optimaiity conditions of LCPs are derived. Some examples are also given to demonstrate these optimality conditions. © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Computer Science Through Urn Games: An Unified Framework for a Hierarchy of Solvable and Unsolvable Problems
Abstract. In his last published paper, Solvable and Unsolvable Problems, printed in 1954 in the popular journal Science News, Alan Turing presented several elegant puzzles aiming at explaining and popularizing problems for which there are algorithms for solutions – the solvable – as well as some for which no such algorithmic solution exists the unsolvable. This paper could be seen as a continua...
متن کاملA Class of Linear Complementarity Problems Solvable in Polynomial Time
We describe a “condition” number for the linear complementarity problem (LCP), which characterizes the degree of difficulty for its solution when a potential reduction algorithm is used. Consequently, we develop a class of LCPs solvable in polynomial time. The result suggests that the convexity (or positive semidefiniteness) of the LCP may not be the basic issue that separates LCPs solvable and...
متن کاملThe Globally Uniquely Solvable Property of Second-Order Cone Linear Complementarity Problems
The globally uniquely solvable (GUS) property of the linear transformation of the linear complementarity problems over symmetric cones has been studied recently by Gowda et al. via the approach of Euclidean Jordan algebra. In this paper, we contribute a new approach to characterizing the GUS property of the linear transformation of the second-order cone linear complementarity problems (SOCLCP) ...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Sign-Solvable Linear Complementarity Problems
This paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined by the sign patterns of the given coefficients. We provide a characterization for sign-solvable LCPs such that the coefficient matrix has nonzero diagonals, which can be tested in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 158 شماره
صفحات -
تاریخ انتشار 2004